BAT: Small and Fast KEM over NTRU Lattices

Efficient Identity-Based Encryption over NTRU Lattices

Efficient implementations of lattice-based cryptographic schemes have been limited to only the most basic primitives like encryption and digital signatures. The main reason for this limitation is that at the core of many advanced lattice primitives is a trapdoor sampling algorithm (Gentry, Peikert, Vaikuntanathan, STOC 2008) that produced outputs that were too long for practical applications. I...

Ideal Lattices and NTRU

ILTRU: An NTRU-Like Public Key Cryptosystem Over Ideal Lattices

In this paper we present a new NTRU-Like public key cryptosystem with security provably based on the worst case hardness of the approximate both Shortest Vector Problem (SVP) and Closest Vector Problem (CVP) in some structured lattices, called ideal lattices. We show how to modify the ETRU cryptosystem, an NTRU-Like public key cryptosystem based on the Eisenstein integers 3 [ ]  where 3  is a...

A Practical Implementation of Identity-Based Encryption over NTRU Lattices

An identity-based encryption scheme enables the efficient distribution of keys in a multi-user system. Such schemes are particularly attractive in resource constrained environments where critical resources such as processing power, memory and bandwidth are severely limited. This research examines the first pragmatic lattice-based IBE scheme presented by Ducas, Lyubashevsky and Prest in 2014 and...

Title: Estimated Breaking times for Ntru Lattices

In this note we report on experiments with the lattices underlying the NTRU Public Key Cryptosystem. We present data for the time needed to nd a small vector and use this data to extrapolate expected breaking times for the NTRU PKCS for various parameter values. In particular, we nd that NTRU 167, NTRU 263, and NTRU 503 are at least as secure as RSA 512, RSA 1024, and RSA 2048 respectively. In ...